﻿#region Copyright (c) 2003 - 2008, Andreas Mueller
/////////////////////////////////////////////////////////////////////////////////////////
// 
// Copyright (c) 2003 - 2008, Andreas Mueller.
// All rights reserved. This program and the accompanying materials
// are made available under the terms of the Eclipse Public License v1.0
// which accompanies this distribution, and is available at
// http://www.eclipse.org/legal/epl-v10.html
//
// Contributors:
//    Andreas Mueller - initial API and implementation
//
// 
// This software is derived from software bearing the following
// restrictions:
// 
// Copyright (c) 1994
// Hewlett-Packard Company
// 
// Permission to use, copy, modify, distribute and sell this software
// and its documentation for any purpose is hereby granted without fee,
// provided that the above copyright notice appear in all copies and
// that both that copyright notice and this permission notice appear
// in supporting documentation.  Hewlett-Packard Company makes no
// representations about the suitability of this software for any
// purpose.  It is provided "as is" without express or implied warranty.
// 
// 
// Copyright (c) 1996,1997
// Silicon Graphics Computer Systems, Inc.
// 
// Permission to use, copy, modify, distribute and sell this software
// and its documentation for any purpose is hereby granted without fee,
// provided that the above copyright notice appear in all copies and
// that both that copyright notice and this permission notice appear
// in supporting documentation.  Silicon Graphics makes no
// representations about the suitability of this software for any
// purpose.  It is provided "as is" without express or implied warranty.
// 
// 
// (C) Copyright Nicolai M. Josuttis 1999.
// Permission to copy, use, modify, sell and distribute this software
// is granted provided this copyright notice appears in all copies.
// This software is provided "as is" without express or implied
// warranty, and with no claim as to its suitability for any purpose.
// 
/////////////////////////////////////////////////////////////////////////////////////////
#endregion


using NStl.SyntaxHelper;
using NUnit.Framework;
using NStl.Collections;
using System.Collections.Generic;
using NUnit.Framework.SyntaxHelpers;
using System;

namespace NStl.NUnit.ContainerFixture.Map
{
    [TestFixture]
    public class InsertFixture
    {
        [Test]
        public void InsertKeyValuePair()
        {
            KeyValuePair<int, string> value = new KeyValuePair<int, string>(0, "42");
            Map<int, string> m = new Map<int, string>(Compare.Less<int>());


            KeyValuePair<Map<int, string>.Iterator, bool> rv = m.Insert(value);

            Assert.That(rv.Value, Is.True);
            Assert.That(m.Count, Is.EqualTo(1));
            Assert.That(rv.Key.Value, Is.EqualTo(value));
        }
        [Test]
        public void InsertDuplicateKeyValuePair()
        {
            KeyValuePair<int, string> value = new KeyValuePair<int, string>(0, "42");
            Map<int, string> m = new Map<int, string>(Compare.Less<int>(), value);


            KeyValuePair<Map<int, string>.Iterator, bool> rv = m.Insert(value);

            Assert.That(rv.Value, Is.False);
            Assert.That(m.Count, Is.EqualTo(1));
            Assert.That(rv.Key.Value, Is.EqualTo(value));
        }
        [Test]
        [ExpectedException(typeof(ArgumentNullException))]
        public void InsertKeyValuePairFailsKeyIsNull()
        {
            Map<string, string> m = new Map<string, string>(Compare.Less<string>());
            m.Insert(new KeyValuePair<string, string>(null, "42"));
        }


        [Test]
        public void InsertKeyAndValue()
        {
            KeyValuePair<int, string> value = new KeyValuePair<int, string>(0, "42");
            Map<int, string> m = new Map<int, string>(Compare.Less<int>());


            KeyValuePair<Map<int, string>.Iterator, bool> rv = m.Insert(value.Key, value.Value);

            Assert.That(rv.Value, Is.True);
            Assert.That(m.Count, Is.EqualTo(1));
            Assert.That(rv.Key.Value, Is.EqualTo(value));
        }

        [Test]
        public void InsertDuplicateKey()
        {
            KeyValuePair<int, string> value = new KeyValuePair<int, string>(0, "42");
            Map<int, string> m = new Map<int, string>(Compare.Less<int>(), value);


            KeyValuePair<Map<int, string>.Iterator, bool> rv = m.Insert(value.Key, "sdfa");

            Assert.That(rv.Value, Is.False);
            Assert.That(m.Count, Is.EqualTo(1));
            Assert.That(rv.Key.Value, Is.EqualTo(value));
        }
        [Test]
        [ExpectedException(typeof(ArgumentNullException))]
        public void InsertKeyAndValueFailsKeyIsNull()
        {
            Map<string, string> m = new Map<string, string>(Compare.Less<string>());
            m.Insert(null, "asdfas");
        }
        [Test]
        public void InsertAtPositionWherePosIsOptimal()
        {
            InsertAtPosition(3);
        }
        [Test]
        public void InsertAtPositionWherePosIsBeforeOptimalPos()
        {
            InsertAtPosition(1);
        }
        [Test]
        public void InsertAtPositionWherePosIsAfterOptimalPos()
        {
            InsertAtPosition(1);
        }
        private static  void InsertAtPosition(int insertPosition)
        {
            Vector<KeyValuePair<int, string>> data = new Vector<KeyValuePair<int, string>>(
                    new KeyValuePair<int, string>(0, "42"),
                    new KeyValuePair<int, string>(3, "42"),
                    new KeyValuePair<int, string>(1, "42"),
                    new KeyValuePair<int, string>(5, "42"),
                    new KeyValuePair<int, string>(2, "42"));

            Vector<KeyValuePair<int, string>> expected = new Vector<KeyValuePair<int, string>>(data);

            Map<int, string> m = new Map<int, string>(Compare.Less<int>(), data);

            Map<int, string>.Iterator it3 = m.Find(insertPosition);

            KeyValuePair<int, string> v = new KeyValuePair<int, string>(4, "xssdgfs");
            Map<int, string>.Iterator rv = m.Insert(it3, v);

            // ... extend and sort the expected
            expected.PushBack(v);
            IBinaryFunction<KeyValuePair<int, string>, KeyValuePair<int, string>, bool>
                comp =
                    Compose.FGxHy(
                        Compare.Less<int>(),
                        Select.FirstFromKeyValuePair<int, string>(),
                        Select.FirstFromKeyValuePair<int, string>()
                                           );
            Algorithm.Sort(expected.Begin(), expected.End(), comp);

            Assert.That(rv.Value, Is.EqualTo(v));
            Assert.That(rv, Is.Not.EqualTo(m.End()));
            Assert.That(m, Is.EqualTo(expected));
        }

        [Test]
        public void InsertRange()
        {
            Vector<KeyValuePair<int, string>> data = new Vector<KeyValuePair<int, string>>(
                    new KeyValuePair<int, string>(0, "42"),
                    new KeyValuePair<int, string>(1, "42"),
                    new KeyValuePair<int, string>(2, "42"),
                    new KeyValuePair<int, string>(3, "42"),
                    new KeyValuePair<int, string>(7, "42"));
            Algorithm.RandomShuffle(data.Begin(), data.End());

            Vector<KeyValuePair<int, string>> toInsert = new Vector<KeyValuePair<int, string>>(
                    new KeyValuePair<int, string>(4, "42"),
                    new KeyValuePair<int, string>(5, "42"),
                    new KeyValuePair<int, string>(6, "42"));

            Vector<KeyValuePair<int, string>> expected = new Vector<KeyValuePair<int, string>>(data);

            Map<int, string> m = new Map<int, string>(Compare.Less<int>(), data);


            m.Insert(toInsert.Begin(), toInsert.End());

            expected.PushBackRange(toInsert);
            IBinaryFunction<KeyValuePair<int, string>, KeyValuePair<int, string>, bool>
                comp =
                    Compose.FGxHy(
                        Compare.Less<int>(),
                        Select.FirstFromKeyValuePair<int, string>(),
                        Select.FirstFromKeyValuePair<int, string>()
                                           );
            Algorithm.Sort(expected.Begin(), expected.End(), comp);

            Assert.That(m, Is.EqualTo(expected));
        }
    }
}
